Binary Search Tree

An rapid parallel algorithm for searching binary search tree

有序二叉树的快速并行检索

Unlike other self-balancing binary search trees that provide worst case O ( log n ) lookup time , scapegoat trees have no additional per-node overhead compared to a regular binary search tree .

和其它的提供了最坏情况O（logn）查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。

The results show that it is more effective than the binary search tree .

结果表明，它比二元查找树更为有效。

This paper applies multidimensional binary search tree ( KD tree ) to DoS detection .

本文提出了将多维二进制搜索树（KD树）应用于DoS攻击检测的方法。

It maintains the free space in heap as nodes in a Cartesian binary search tree format .

它按照Cartesian二分法检索树格式以节点的形式维护堆中的空闲空间。

Red-black tree is a self-balancing binary search tree .

红黑树是一个自平衡的二叉查找树。

Different with the general binary search tree , it does not contain any internal empty nodes , which is able to achieve better spatial performance .

与一般的二叉查找树不同，其不包含任何内部空节点，可以达到较好的空间性能。

The highly balanced binary search tree is established in order to improve efficiency of the binary search tree and to shorten the average search tree .

建立高度平衡的二叉搜索树是为了提高二叉搜索树的效率，减少树的平均搜索长度。

Some limit laws for the branches and subtrees in a random recursive tree and binary search tree are established in this dissertation .

本文主要研究随机递归树和随机二叉搜索树上与分支和子树相关的极限定理。

Using a binary search tree or dividing the string into segments as long as the square root of the length of the string will solve the problem .

用一个二叉搜索树或者将串切分成长度的平方根那么长的小段都可以解决这个问题。

For the dynamic menu structure , the framework uses a binary search tree in order to speed up the depth search , and introduces fast cache to reduce the response time of the component functions which are used highly frequently .

为了优化性能，针对动态菜单的结构，该框架采用二叉查找树提高了深度查找速度，利用快速缓存提高了使用频率较高的组件功能的响应速度。

An Efficient Binary Search Tree-Red / Black Tree

一种高效的二叉查找树&红黑树

In this paper a new binary search tree-red / black tree is introduced , it 's definition and the way to create it are given , and it 's search effieiency in the worst condition is estimated .

作者给出了一种新的二叉查找树&红黑树的定义和建树方法，并给出了它在最坏情况下的查找效率估计。